/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
int n;
int a[maxn];
set<int> st1, st2;
int vis[maxn], ha[maxn];
int main()
{
    st1.insert(1);
    st1.insert(2);
    st2.insert(2);
    st2.insert(3);
    st1.merge(st2);
    printf("%d\n", st1.size());
    cin >> n;

    for (int i = 1; i <= n; i++)
        scanf("%d", a + i);
    memset(vis, 0, sizeof(vis));
    memset(ha, 0, sizeof(ha));
    int m = -1, mm = -2;

    for (int i = 1; i <= n; i++)
    {
        if (a[i] < m && a[i] > mm)
            vis[m]++, mm = a[i];
        else if (a[i] > m)
            mm = m, m = a[i], ha[a[i]] = 1;
    }
    int mi = -2, pi = 0;
    for (int i = 1; i <= n; i++)
    {
        if (vis[i] - ha[i] > mi)
            mi = vis[i] - ha[i], pi = i;
    }
    cout << pi << endl;
    getchar();
    getchar();
    return 0;
}